Efficient heuristics to minimize the total tardiness of chemotherapy drug production and delivery
نویسندگان
چکیده
This study considers the production of chemotherapy drugs for cancer treatment. An important factor determining quality service treatment is time patient must wait to receive his or her injection drug. Chemotherapy and delivery are modeled as a scheduling problem combined with vehicle routing problem. The three-stage hybrid flow shop problem, variant multi-trip due dates. objective function minimization total delay To solve this we propose several heuristic algorithms provide solutions within reasonable computation times. Computational experiments used compare performance heuristics applied real data-based random instances.
منابع مشابه
Designing Dispatching Rules to Minimize Total Tardiness
We approximate optimal solutions to the Flexible Job-Shop Problem by using dispatching rules discovered through Genetic Programming. While Simple Priority Rules have been widely applied in practice, their efficacy remains poor due to lack of a global view. Composite Dispatching Rules have been shown to be more effective as they are constructed through human experience. In this work, we employ s...
متن کاملScheduling a variant of flowshop problems to minimize total tardiness
This paper studies no-wait flowshop scheduling problems to minimize total tardiness. This paper mathematically formulates the problem as an effective mixed integer linear programming model. Moreover, this paper proposes solution methods based on variable neighborhood search and simulated annealing algorithms. Besides, some well-known heuristics of classical flow shops are adapted to the case of...
متن کاملNo-Wait Flowshops to Minimize Total Tardiness with Setup Times
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been investigated and three were found to be superior. Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching ru...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملScheduling preemptive open shops to minimize total tardiness
This article considers the problem of scheduling preemptive open shops to minimize total tardiness. The problem is known to be NP-hard. An efficient constructive heuristic is developed for solving large-sized problems. A branch-and-bound algorithm that incorporates a lower bound scheme based on the solution of an assignment problem as well as various dominance rules are presented for solving me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Flexible Services and Manufacturing Journal
سال: 2021
ISSN: ['1936-6582', '1936-6590']
DOI: https://doi.org/10.1007/s10696-021-09431-w